Adaptive Wormhole Routing in Hypercube Multicomputers

In this paper, we propose a uniform adaptive routing strategy for wormhole-routed hypercube networks that accommodates both unicast and multicast communication. Based on a node labeling method, the resultant routing algorithms are shown to be deadlock-free without requiring virtual channels. The order in which the destinations are visited is important to ee-ciency. We present an ordering algorithm, quadratic in the number of destinations, which is optimal in that it minimizes the traac generated under the proposed paradigm. A greedy algorithm is also proposed for ordering the destinations, which requires less time and space to execute but creates more traac than the optimal algorithm. Simulation results that evaluate the performance of the proposed routing algorithms are presented.